package caip2025n.rcv1;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.LinkedList;

public class Main {
	
	public static void main(String[] args) throws IOException {
		//输入优化
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        //输出优化
        StringBuilder sb = new StringBuilder();
        
        String[] lineArr = br.readLine().split(" ");
        
        int n = Integer.parseInt(lineArr[0]);
        int d = Integer.parseInt(lineArr[1]);
        int k = Integer.parseInt(lineArr[2]);
        
        //递增量数组
        int[] dzl = new int[d];
        
        //递增量数组的前缀和
        int[] qzdzl = new int[d];
        
        //当前最大值
        int max = 0;
        
        //记录答案
        LinkedList<Integer> ans = new LinkedList<>();
        
        //读取n行
        for(int i=0;i<n;i++) {
        	//读取行数据
        	lineArr = br.readLine().split(" ");
        	//当前天最大增量
        	int sum=0;
        	//连续递增起始位置
        	int l = 0;       	
        	for(int j=1;j<d;j++) {
        		dzl[j] = Integer.parseInt(lineArr[j]) - Integer.parseInt(lineArr[j-1]);
        		qzdzl[j] = qzdzl[j-1]+dzl[j];
        		if(dzl[j]<=0) {
        			l = j;
        		}
        		if(j-l+1>=k) {
        			//求和[j-k+1...j]
        			sum = Math.max(sum, qzdzl[j]-qzdzl[j-k+1]);
        		}
        	}
        	if(sum>max) {
        		max = sum;
        		ans.clear();
        		ans.add(i+1);
        	}else if(sum==max) {
        		ans.add(i+1);
        	}
        }       
        sb.append(max+"/"+k);
        sb.append("\n");
    	while(ans.size()>1) {
    		sb.append(ans.poll());
    		sb.append(" ");
    	}
    	sb.append(ans.poll());
    	System.out.print(sb.toString());
	}
}
